How to Obtain Global Information From Computations Over Finite Fields
نویسندگان
چکیده
This is an extended version of the talk I gave at the summer school in Göttingen in July 2007. We discuss the Mordell-Weil Sieve and some applications.
منابع مشابه
Classical wavelet systems over finite fields
This article presents an analytic approach to study admissibility conditions related to classical full wavelet systems over finite fields using tools from computational harmonic analysis and theoretical linear algebra. It is shown that for a large class of non-zero window signals (wavelets), the generated classical full wavelet systems constitute a frame whose canonical dual are classical full ...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملClassical Wavelet Transforms over Finite Fields
This article introduces a systematic study for computational aspects of classical wavelet transforms over finite fields using tools from computational harmonic analysis and also theoretical linear algebra. We present a concrete formulation for the Frobenius norm of the classical wavelet transforms over finite fields. It is shown that each vector defined over a finite field can be represented as...
متن کاملNon-hyperelliptic curves of genus three over finite fields of characteristic two
Let k be a finite field of even characteristic. We obtain in this paper a complete classification, up to k-isomorphism, of non singular quartic plane curves defined over k. We find explicit rational normal models and we give closed formulas for the total number of k-isomorphism classes. We deduce from these computations the number of k-rational points of the different strata by the Newton polyg...
متن کاملGPU and APU computations of Finite Time Lyapunov Exponent fields
We present GPU and APU accelerated computations of Finite-Time Lyapunov Exponent (FTLE) fields. The calculation of FTLEs is a computationally intensive process, as in order to obtain the sharp ridges associated with the Lagrangian Coherent Structures an extensive resampling of the flow field is required. The computational performance of this resampling is limited by the memory bandwidth of the ...
متن کامل